Parameter-based Fisher's Information of Orthog- Onal Polynomials
نویسندگان
چکیده
The Fisher information of the classical orthogonal polynomials with respect to a parameter is introduced, its interest justified and its explicit expression for the Jacobi, Laguerre, Gegenbauer and Grosjean polynomials found.
منابع مشابه
Extended Jacobi and Laguerre Functions and their Applications
The aim of this paper is to introduce two new extensions of the Jacobi and Laguerre polynomials as the eigenfunctions of two non-classical Sturm-Liouville problems. We prove some important properties of these operators such as: These sets of functions are orthogonal with respect to a positive de nite inner product de ned over the compact intervals [-1, 1] and [0,1), respectively and also th...
متن کاملOn Fisher's information matrix of ARMA process and Sylvester's resultant matrix
We consider two relations between Fisher's information matrix of a stationary ARMA (autoregressive moving average) process and Sylvester's resultant matrix. One is based on the Wald test statistic for testing common roots of the AR and MA polynomials of an ARMA process, and the other one is established by using the structure of Fisher's information matrix. It turns out that the latter is also a...
متن کاملInformation Geometry on Hierarchical Decomposition of Stochastic Interactions
A joint probability distribution represents stochastic dependency among a number of random variables. They in general have complex structure of dependencies. A pairwise dependency is easily represented by correlation, but it is more diicult to extract triplewise or higher-order interactions (dependencies) among these variables. They form a hierarchy of dependencies. The present paper decomposes...
متن کاملLogarithmic information of degree q linked with an extension of Fisher's information
We introduce the Fisher's information of degree q, q e 2/V*, of a given random variable X, with a density function depending on a parameter 0, 6 e 0, the average Fisher's information of this variable when the parameter is itself random, and the logarithmic information of degree q which characterizes this one. We exhibit relations concerning these 3 quantities and we more particularly obtain ext...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کامل